Sequential monotonicity for restarting automata

Restarting Automata and Variants of j-Monotonicity

In the literature various notions of (non-) monotonicity of restarting automata have been studied. Here we introduce two new variants of (non-) monotonicity for restarting automata and for two-way restarting automata: left (non-) monotonicity and right-left (non-) monotonicity. It is shown that for the various types of deterministic and nondeterministic (two-way) restarting automata without aux...

Restarting Tree Automata

Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata

Some lower bound results are presented that separate the language classes accepted by certain types of nonforgetting restarting automata or CD-systems of restarting automata from each other.

On h-Lexicalized Restarting Automata

Following some previous studies on restarting automata, we introduce a refined model – the hlexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the input languages, which are the languages traditionally considered in automata theory, to the so-called basic and h-proper languages, which are (impl...

Restarting Automata: Motivations and Applications

Automata with restart operation (henceforth RA) constitute an interesting class of acceptors and reduction systems at the same time, and simultaneously display a remarkable ’explicative power’ wrt. the analysis of formal and natural languages. This paper focuses on RA as a formal-theoretical tool for modelling the analysis by reduction of natural languages and on the role of analysis by reducti...